On the computational complexity of exterior products
نویسنده
چکیده
where ∧ denotes exterior product. The above expression is the exterior product of M two-forms of rank two, which produces a volume form D2,2(v1, . . . , v4M ) in the 2M -dimensional linear space. If we fix a basis e1, . . . , e2M in the linear space, then each of the vectors vi can be expressed as a sequence of 2M numbers, and D2,2(v1, . . . , v4M ) is also a number (the coefficient at e1∧. . .∧e2M ). In other terms, D2,2(v1, . . . , v4M ) is a sum of 2 determinants of 2M × 2M matrices composed of vectors vi: the matrix is split into M pair of rows, and, for each pair of rows, two pairs of vectors vi are considered (for the first pair of rows, either v1 and v2 or v3 and v4, and so on). It is well known that computing the determinant of a matrix can be done in a time polynomial in the matrix dimension (see, e.g., the textbook [1]). One may therefore pose a question if a calculation of D2,2(v1, . . . , v4M ) could also be optimized to a polynomial in M number of operations. The result of this paper answers this question negatively, assuming that #P-hard problems cannot be solved in polynomial time. More precisely, I show that computing D2,2(v1, . . . , v4M ) is at least as difficult as computing a permanent of a matrix, which is, in turn, known to be #P-complete [2]. The proof is done by re-expressing the permanent of an arbitrary N × N matrix as D2,2(v1, . . . , v4M ) with M = N for a specially chosen set of vectors vi. The details of the proof are presented in Section II. An alternative proof was communicated to me by L. Gurvits [3] based on a relation to mixed discriminants [4–6]. This proof is outlined in Section III. Section IV contains a brief discussion of the result, including some simple generalizations. Finally, the last section provides a physical motivation for considering the function (1). Namely, it emerges in one of the attempts to generalize the BosonSampling proposal for quantum computing [7] to the sampling of noninteracting fermions with the initial state entangled in a special way.
منابع مشابه
On the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملBiclique Cryptanalysis of Block Ciphers LBlock and TWINE-80 with Practical Data Complexity
In the biclique attack, a shorter biclique usually results in less data complexity, but at the expense of more computational complexity. The early abort technique can be used in partial matching part of the biclique attack in order to slightly reduce the computations. In this paper, we make use of this technique, but instead of slight improvement in the computational complexity, we keep the amo...
متن کاملOn the Computational Complexity of the Domination Game
The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the...
متن کاملExamine the complexity of Iran’s Petrochemical Industry and its future opportunities
This research aims to investigate technological capabilities competitiveness of Iran’s petrochemical industry products in 2016 . The main questions of the study are 1) in which petrochemical industry products does Iran enjoys a revealed comparative advantage? 2) what are the opportunities for Iran to diversify petrochemical export basket? in order to answer these questions we have used an appro...
متن کاملThe non-abelian tensor product of normal crossed submodules of groups
In this article, the notions of non-abelian tensor and exterior products of two normal crossed submodules of a given crossed module of groups are introduced and some of their basic properties are established. In particular, we investigate some common properties between normal crossed modules and their tensor products, and present some bounds on the nilpotency class and solvability length of the...
متن کاملVibration Analysis of Global Near-regular Mechanical Systems
Some near-regular mechanical systems involve global deviations from their corresponding regular system. Despite extensive research on vibration analysis (eigensolution) of regular and local near-regular mechanical systems, the literature on vibration analysis of global near-regular mechanical systems is scant. In this paper, a method for vibration analysis of such systems was developed using Kr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1603.02724 شماره
صفحات -
تاریخ انتشار 2016